Context-Free Parsing With Finite-State Transducers
نویسندگان
چکیده
Analyse syntaxique du frann cais. Grammaire en cha^ ne. Number 2 in Etudes en linguistique frann caise et g en erale. Benjamins, Am-sterdam, 1979. Tom86] Masaru Tomita. EEcient Parsing for Natural Language. A fast algorithm for practical systems. Kluwer, Boston/Dordrecht/Lancaster, 1986. 201 p.
منابع مشابه
Applications of Weighted Automata in Natural Language Processing
Linguistics and automata theory were at one time tightly knit. Very early on, finite-state processes were used by Markov [35, 27] to predict sequences of vowels and consonants in novels by Pushkin. Shannon [48] extended this idea to predict letter sequences of English words using Markov processes. While many theorems about finite-state acceptors (FSAs) and finite-state transducers (FSTs) were p...
متن کاملAbstract parsing with string updates using LR-parsing technology
parsing with string updates using LR-parsing technology Kyung-Goo Doh, Hyunha Kim, David A. Schmidt 1 Hanyang University, Ansan, South Korea 2 Kansas State University, Manhattan, Kansas, USA Abstract. We combine LR(k)-parsing technology and data-flow analysis to analyze, in advance of execution, the documents generated dynamically by a program. Based on the document language’s context-free refe...
متن کاملIntegration of supra-lexical linguistic models with speech recognition using shallow parsing and finite state transducers
This paper proposes a layered Finite State Transducer (FST) framework integrating hierarchical supra-lexical linguistic knowledge into speech recognition based on shallow parsing. The shallow parsing grammar is derived directly from the full fledged grammar for natural language understanding, and augmented with top-level n-gram probabilities and phrase-level context-dependent probabilities, whi...
متن کاملLR - parsing
LR-parsing Kyung-Goo Doh, Hyunha Kim, David A. Schmidt 1 Hanyang University, Ansan, South Korea 2 Kansas State University, Manhattan, Kansas, USA Abstract. We combine LR(k)-parsing technology and data-flow analysis to analyze, in advance of execution, the documents generated dynamically by a program. Based on the document language’s context-free reference grammar and the program’s control struc...
متن کاملStochastic Inversion Transduction Grammars, with Application to Segmentation, Bracketing, and Alignment of Parallel Corpora
We introduce (1) a novel stochastic inversion transduction grammar formalism for bilingual language modeling of sentence-pairs, and (2) the concept of bilingual parsing with potential application to a variety of parallel corpus analysis problems. The formalism combines three tactics against the constraints that render finite-state transducers less useful: it skips directly to a context-free rat...
متن کامل